Reusability for Parallel Hybrid Numerical Methods

نویسندگان

  • Nahid Emad
  • Ani Sedrakian
چکیده

LAKe (Linear Algebra Kernel) is a linear algebra class library developed using an object oriented approach, in order to enable very good code reuse for sequential and parallel linear algebra applications. An application implemented using LAKe can be run either in sequential or parallel mode using the same code. In this paper we propose an extension to the LAKe library, which allows making use of the same code for both sequential, and different fine grain parallelism of these methods, at the same time. This extension of LAKe allows a concurrent reuse of sequential and parallel components in the same linear algebra application. The hybrid methods are one of the well known ones which needs such properties to run. These methods are combination of several numerical techniques, or several copy of the same method parameterized differently in order to accelerate the convergence and/or to improve the accuracy of the solution of some large linear algebra problems. Some numerical experiments validate our approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Toward the reusability for iterative linear algebra software in distributed environment

LAKe (Linear Algebra Kernel) is a linear algebra class library developed using an object oriented approach in order to enable a good reuse code for sequential or parallel linear algebra applications. An application implemented using LAKe can be run either in sequential or in parallel mode using the same code. This paper proposes an extension to the LAKe library, which enables an implemented met...

متن کامل

Common solutions to pseudomonotone equilibrium problems

‎In this paper‎, ‎we propose two iterative methods for finding a common solution of a finite family of equilibrium problems ‎for pseudomonotone bifunctions‎. ‎The first is a parallel hybrid extragradient-cutting algorithm which is extended from the‎ ‎previously known one for variational inequalities to equilibrium problems‎. ‎The second is a new cyclic hybrid‎ ‎extragradient-cutting algorithm‎....

متن کامل

Hybrid artificial immune system and simulated annealing algorithms for solving hybrid JIT flow shop with parallel batches and machine eligibility

This research deals with a hybrid flow shop scheduling problem with parallel batching, machine eligibility, unrelated parallel machine, and different release dates to minimize the sum of the total weighted earliness and tardiness (ET) penalties. In parallel batching situation, it is supposed that number of machine in some stages are able to perform a certain number of jobs simultaneously. First...

متن کامل

A New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters

In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...

متن کامل

Implicit One-step L-stable Generalized Hybrid Methods for the Numerical Solution of First Order Initial Value problems

In this paper, we introduce the new class of implicit L-stable generalized hybrid methods for the numerical solution of first order initial value problems. We generalize the hybrid methods with utilize ynv directly in the right hand side of classical hybrid methods. The numerical experimentation showed that our method is considerably more efficient compared to well known methods used for the n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004